Search results for "Combinatorial search"
showing 2 items of 2 documents
A hybrid genetic algorithm with local search: I. Discrete variables: optimisation of complementary mobile phases
2001
Abstract A hybrid genetic algorithm was developed for a combinatorial optimisation problem. The assayed hybridation modifies the reproduction pattern of the genetic algorithm through the application of a local search method, which enhances each individual in each generation. The method is applied to the optimisation of the mobile phase composition in liquid chromatography, using two or more mobile phases of complementary behaviour. Each of these phases concerns the optimal separation of certain compounds in the analysed mixture, while the others can remain overlapped. This optimisation approach may be useful in situations where full resolution with a single mobile phase is unfeasible. The o…
Comparative study of techniques for large-scale feature selection* *This work was suported by a SERC grant GR/E 97549. The first author was also supp…
1994
The combinatorial search problem arising in feature selection in high dimensional spaces is considered. Recently developed techniques based on the classical sequential methods and the (l, r) search called Floating search algorithms are compared against the Genetic approach to feature subset search. Both approaches have been designed with the view to give a good compromise between efficiency and effectiveness for large problems. The purpose of this paper is to investigate the applicability of these techniques to high dimensional problems of feature selection. The aim is to establish whether the properties inferred for these techniques from medium scale experiments involving up to a few tens …